Vere-Jones’ self-similar branching model

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-similar branching Markov chains

The main purpose of this work is to study self-similar branching Markov chains. First we will construct such a process. Then we will establish certain Limit Theorems using the theory of self-similar Markov processes.

متن کامل

Constant Slope Maps and the Vere-Jones Classification

We study continuous countably-piecewise monotone interval maps and formulate conditions under which these are conjugate to maps of constant slope, particularly when this slope is given by the topological entropy of the map. We confine our investigation to the Markov case and phrase our conditions in the terminology of the Vere-Jones classification of infinite matrices.

متن کامل

Multifractal spectra for random self-similar measures via branching processes

Abstract Start with a compact set K ⊂ Rd. This has a random number of daughter sets each of which is a (rotated and scaled) copy of K and all of which are inside K. The random mechanism for producing daughter sets is used independently on each of the daughter sets to produce the second generation of sets, and so on, repeatedly. The random fractal set F is the limit, as n goes to infinity, of th...

متن کامل

On the Vere-jones Classification and Existence of Maximal Measures for Countable Topological Markov Chains

We consider topological Markov chains (also called Markov shifts) on countable graphs. We show that a transient graph can be extended to a recurrent graph of equal entropy which is either positive recurrent of null recurrent, and we give an example of each type. We extend the notion of local entropy to topological Markov chains and prove that a transitive Markov chain admits a measure of maxima...

متن کامل

On the Vere-Jones classi cation and existence of maximal measures for topological Markov chains

We show that a transient graph can be extended to a recurrent graph of equal entropy which is either positive recurrent of null recurrent, and we give an example of each type. We extend the notion of local entropy to topological Markov chains and prove that a transitive Markov chain admits a measure of maximal entropy (or maximal measure) whenever its local entropy is less than its (global) ent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2005

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.72.056122